Two results on the digraph chromatic number

It is known (Bollobás [4]; Kostochka and Mazurova [13]) that there exist graphs of maximum degree ∆ and of arbitrarily large girth whose chromatic number is at least c∆/ log ∆. We show an analogous result for digraphs where the chromatic number of a digraph D is defined as the minimum integer k so that V (D) can be partitioned into k acyclic sets, and the girth is the length of the shortest cycle in the corresponding undirected graph. It is also shown, in the same vein as an old result of Erdős [6], that there are digraphs with arbitrarily large chromatic number where every large subset of vertices is 2-colorable.